Super-polynomial approximation branching algorithms
نویسندگان
چکیده
We give sufficient conditions for deriving moderately exponential and/or parameterized time approximation schemata (i.e., algorithms achieving ratios 1± , for arbitrarily small ) for broad classes of combinatorial optimization problems via a well-known technique widely used for deriving exact algorithms, namely the branching tree pruning. Mathematics Subject Classification. 68W25, 05C85, 68Q25. Received June 11, 2015. Accepted November 23, 2015.
منابع مشابه
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
Using ideas and results from polynomial approximation and exact computation we design approximation algorithms for several NP-hard combinatorial problems achieving ratios that cannot be achieved in polynomial time (unless a very unlikely complexity conjecture is confirmed) with worst-case complexity much lower (though super-polynomial) than that of an exact computation. We study in particular m...
متن کاملPolynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs
We give a deterministic, polynomial-time algorithm for approximately counting the number of {0, 1}-solutions to any instance of the knapsack problem. On an instance of length n with total weight W and accuracy parameter ε, our algorithm produces a (1 + ε)-multiplicative approximation in time poly(n, logW, 1/ε). We also give algorithms with identical guarantees for general integer knapsack, the ...
متن کاملApproximation and parameterized algorithms for common subtrees and edit distance between unordered trees
Given two rooted, labeled, unordered trees, the common subtree problem is to find a bijective matching between subsets of nodes of the trees of maximum cardinality which preserves labels and ancestry relationship. The tree edit distance problem is to determine the least cost sequence of insertions, deletions and substitutions that converts a tree into another given tree. Both problems are known...
متن کاملA Characterisation of NL/poly via Nondeterministic Finite Automata
For each language L ⊆ 2 and non-zero monotonic function t ∶ N → N, we define a language t∗L ⊆ 2 depending only on L and t. We then prove that a language L lies in NL/poly if and only if there exists a polynomially bounded t (as above), such that the projections (t ∗L) ∩ 2 are accepted by nondeterministic finite automata of size polynomial in n. Therefore, proving super-polynomial lower bounds f...
متن کاملGreatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
We give polynomial time algorithms for quantitative (and qualitative) reachability analysis for Branching Markov Decision Processes (BMDPs). Specifically, given a BMDP, and given an initial population, where the objective of the controller is to maximize (or minimize) the probability of eventually reaching a population that contains an object of a desired (or undesired) type, we give algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- RAIRO - Operations Research
دوره 50 شماره
صفحات -
تاریخ انتشار 2016